Mapping DTDs to relational schemas with semantic constraints
نویسندگان
چکیده
XML is becoming a prevalent format and standard for data exchange in many applications. With the increase of XML data, there is an urgent need to research some efficient methods to store and manage XML data. As relational databases are the primary choices for this purpose considering their data management power, it is necessary to research the problem of mapping XML schemas to relational schemas. The semantics of XML schemas are crucial to design, query, and store XML documents and functional dependencies are very important representations of semantic information of XML schemas. As DTDs are one of the most frequently used schemas for XML documents in these days, we will use DTDs as schemas of XML documents here. This paper proposes the concept and the formal definition of XML functional dependencies over DTDs. A method to map XML DTDs to relational schemas with constraints such as functional dependencies, domain constraints, choice constraints, reference constraints, and cardinality constraints over DTDs is given, which can preserve the structures of DTDs as well as the semantics implied by the above constraints over DTDs. The concepts and method of mapping DTDs to relational schemas presented in the paper can be extended to the field of XML Schema just with some modifications in related formal definitions. q 2005 Elsevier Ltd All rights reserved.
منابع مشابه
Inference Document Type (Dtd) From Xml Document: Web Structure Mining
XML is becoming a prevalent format and defacto standard for data exchange in many applications. While traditionally, lots of data are stored and managed in relational databases. There is an urgent need to research some efficient methods to convert these data stored in relational databases to XML format when integrating and exchanging these data in XML format. The semantics of XML schemas are cr...
متن کاملA Uni ed Constraint Model for XML
Integrity constraints are an essential part of modern schema de nition languages. They are useful for semantic speci cation, update consistency control, query optimization, etc. In this paper, we propose UCM, a model of integrity constraints for XML that is both simple and expressive. Because it relies on a single notion of keys and foreign keys, the UCMmodel is easy to use and makes formal rea...
متن کاملCapturing Relational Schemas and Functional Dependencies in RDFS
Mapping relational data to RDF is an important task for the development of the Semantic Web. To this end, the W3C has recently released a Recommendation for the so-called direct mapping of relational data to RDF. In this work, we propose an enrichment of the direct mapping to make it more faithful by transferring also semantic information present in the relational schema from the relational wor...
متن کاملTransforming OWL 2 RL Schemas to Relational Schemas with Open-world or Closed-world Semantics
Storing and processing Semantic Web knowledge in relational database management systems (RDBMSs) is currently a growing interest in both academia and industry. In this paper, we present OWLRel, a database-driven ontology reasoner that supports sound reasoning of OWL 2 RL and can adhere to either the open-world assumption or the closed-world assumption. This is achieved by regarding the mapping ...
متن کاملMatching of XML Schemas and Relational Schemas
XML is widely used for data exchange between relational databases. Generic exchange tools are based on mappings between the elements of both schemas. Despite the benefits of using generic tools, the manual definition of the mappings can become a time consuming and error-prone task. Given this scenario we propose algorithms for the automatic matching of XML schemas(DTDs) and relational schemas. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Information & Software Technology
دوره 48 شماره
صفحات -
تاریخ انتشار 2006